import org.korifey.ffalg.NumberTheory;


public class Problem6 {
	public static void main(String[] args) {
		System.out.println(solve());
	}

	public static long solve() {
		int n = 100;		
		int s1 = n*(n+1)/2;		
		int s2 = n*(n+1)*(2*n+1)/6;
		return s1*s1 - s2;
	}
}
